LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1

Source URL: www.levreyzin.com

• Computational complexity theory
• Theory of computation
• Theoretical computer science
• Circuit complexity
• Complexity classes
• Logic in computer science
• Clique problem
• Boolean circuit
• Clique
• Circuit
• ACC0
• NC

Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004

Source URL: vigna.di.unimi.it

• Computational complexity theory
• Theory of computation
• Complexity classes
• NP-complete problems
• Mathematical optimization
• NP-hard problems
• MAX-3SAT
• NP
• Approximation algorithm
• Probabilistically checkable proof
• PCP theorem
• APX

ANNEXURE D: LIST OF REPUTED PUBLICATIONS IN CSE Acronym SIGCOMM SIGMETRICS CCS

Source URL: www.cse.iitd.ac.in

• Academia
• Computer science
• Computing
• Theoretical computer science
• Association for Computing Machinery
• ACM SIGACT
• International Conference on Functional Programming
• Computational intelligence
• Computational geometry
• Computational learning theory
• International Symposium on Symbolic and Algebraic Computation
• Algorithmica

c Cambridge University Press 2009 JFP: page 1 of 24.  1 doi:S0956796809990219

Source URL: www.cs.ioc.ee

• Logic in computer science
• Programming language semantics
• Models of computation
• Computability theory
• Logic programming
• Substitution
• Operational semantics
• Denotational semantics
• Lambda calculus
• Structure

A Virtual Machine for Functional Logic Computations⋆ Sergio Antoy1 , Michael Hanus2 , Jimeng Liu1 , and Andrew Tolmach1 1 2

Source URL: web.cecs.pdx.edu

• Software engineering
• Computer programming
• Computing
• Programming paradigms
• Computability theory
• Subroutines
• Programming idioms
• Models of computation
• Functional programming
• Curry
• Prolog
• Recursion

Denotational semantics for lazy initialization of letrec black holes as exceptions rather than divergence Keiko Nakata Institute of Cybernetics at Tallinn University of Technology Abstract We present a denotational seman

Source URL: www.cs.ioc.ee

• Theoretical computer science
• Models of computation
• Mathematical logic
• Software engineering
• Computability theory
• Denotational semantics
• Logic in computer science
• Lambda calculus
• Substitution
• Function type

Lineage-driven Fault Injection Peter Alvaro Joshua Rosen UC Berkeley

Source URL: people.ucsc.edu

• Computing
• Fault-tolerant computer systems
• Concurrent computing
• Data management
• Failure
• Fault tolerance
• Theory of computation
• Consensus
• Two-phase commit protocol
• Byzantine fault tolerance
• Data lineage
• Distributed computing

M EMORAX, a precise and sound tool for automatic fence insertion under TSO ? Parosh Aziz Abdulla1 , Mohamed Faouzi Atig1 , Yu-Fang Chen2 , Carl Leonardsson1 , and Ahmed Rezine3 1

Source URL: user.it.uu.se

• Theoretical computer science
• Mathematics
• Finite automata
• Computing
• Theory of computation
• Formal methods
• Reachability problem
• Logic in computer science
• Model checking
• Memory barrier
• Preorder
• Algorithm

ECS 120 Notes David Doty based on Introduction to the Theory of Computation by Michael Sipser ii

Source URL: web.cs.ucdavis.edu

MCS 441 – Theory of Computation I Spring 2013 Problem Set 8 Lev Reyzin Due: at the beginning of class Related reading: Chapters 5 and 6.

Source URL: homepages.math.uic.edu